منابع مشابه
The pi-calculus
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...
متن کاملThe Attributed Pi Calculus
The attributed pi calculus (π(L)) forms an extension of the pi calculus with attributed processes and attribute dependent synchronization. To ensure flexibility, the calculus is parametrized with the language L which defines possible values of attributes. π(L) can express polyadic synchronization as in pi@ and thus diverse compartment organizations. A non-deterministic and a stochastic semantic...
متن کاملThe Pi-Calculus as a Theory in Linear Logic
The agent expressions of the -calculus can be translated into a theory of linear logic in such a way that the re ective and transitive closure of -calculus (unlabeled) reduction is identi ed with \entailed-by". Under this translation, parallel composition is mapped to the multiplicative disjunct (\par") and restriction is mapped to universal quanti cation. Pre xing, non-deterministic choice (+)...
متن کاملThe Weak Late pi-Calculus Semantics as Observation Equivalence
We show that the Weak Late-calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, due e.g. to communication, are explicitly handled via suitable constructors. The approach presented here allows to axiomatize the Weak Late-calculus semantics by simply adding Mil...
متن کاملMatching in the Pi-Calculus
We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2006
ISSN: 1542-7730,1542-7749
DOI: 10.1145/1142055.1142078